FP-Tree based Association Rule Mining in Academic Social Networks to Refine RDF Framework and FOAF
نویسندگان
چکیده
In order to analyze large scale social networks, different strategies are being implemented. The traditional methods of data mining are getting transformed to be suitable to the requirements of the web based information available in different structured and unstructured formats. The process of web mining, a versatile methodology of data mining, involves modified mining techniques applied on documents spread across the World Wide Web. In this proposed work, the process of association rule mining is applied to Academic Social Networks, an offshoot of Social networks. This technique involves processing of profile pages of members stored in FOAF format and retrieving the association rules from the data to identify the strength of relationship amongst researchers. The RDF vocabulary, a standard format of web based identity representation is the building block of this entire framework. Traditional applications of association rule mining is referred in the context of Market Basket analysis, and its application is projected to analyze dense network and derive association patterns amongst members of the academic social network.
منابع مشابه
An Improved FP-Tree Algorithm with Relationship Technique for Refined Result of Association Rule Mining
Construction and development of classifier that works with more accuracy and performs efficiently for large database is one of the key tasks of data mining techniques. Secondly training dataset repeatedly produces massive amount of rules. It’s very tough to store, retrieve, prune, and sort a huge number of rules proficiently before applying to a classifier. In such situation FP is the best choi...
متن کاملA Novel Method for Selecting the Supplier Based on Association Rule Mining
One of important problems in supply chains management is supplier selection. In a company, there are massive data from various departments so that extracting knowledge from the company’s data is too complicated. Many researchers have solved this problem by some methods like fuzzy set theory, goal programming, multi objective programming, the liner programming, mixed integer programming, analyti...
متن کاملA Frequent Pattern Mining Algorithm Based on Fp-tree Structure Andapriori Algorithm
Association rule mining is used to find association relationships among large data sets. Mining frequent patterns is an importantaspect in association rule mining. In this paper, an algorithm named Apriori-Growth based on Apriori algorithm and the FP-tree structure is presented to mine frequent patterns. The advantage of the Apriori-Growth algorithm is that it doesn’t need to generate condition...
متن کاملSecure Two-Party Association Rule Mining Based on One-Pass FP-Tree
Frequent Path tree (FP-tree) is a popular method to compute association rules and is faster than Aprioribased solutions in some cases. Association rule mining using FP-tree method cannot ensure entire privacy since frequency of the itemsets are required to share among participants at the first stage. Moreover, FP-tree method requires two scans of database transactions which may not be the best ...
متن کاملImproved algorithm for mining maximum frequent patterns based on FP-Tree
Mining association rule is an important matter in data mining, in which mining maximum frequent patterns is a key problem. Many of the previous algorithms mine maximum frequent patterns by producing candidate patterns firstly, then pruning. But the cost of producing candidate patterns is very high, especially when there exists long patterns. In this paper, the structure of a FP-tree is improved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013